Effects of Curved Lines on Force-Directed Graphs

نویسنده

  • Marshall Couch
چکیده

..........................................................................................................................................

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Curvilinear Graph Drawing Using the Force-Directed Method

We present a method for modifying a force-directed graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm...

متن کامل

An Elasticity Solution for Static Analysis of Functionally Graded Curved Beam Subjected to a Shear Force

In this paper, using 2-D theory of elasticity, a closed-form solution is presented for stressdistributions and displacements of a FG curved beam under shear force at its free end. The materialproperties are assumed to vary continuously through the radial direction based on a simple power lawmodel and Poisson’s ratio is supposed to be constant. In order to verify the solution, it is shown that a...

متن کامل

An improved force-directed graph layout algorithm based on aesthetic criteria

The force-directed graph layout algorithm is one of the most widely used algorithms for drawing graphs. It aims at improving the graphs’ readability and understanding by producing high-quality drawings. However, the traditional algorithm, while trying to find the most stable position for each vertex, fails to produce graphs that satisfy different aesthetic criteria. In this paper, we present an...

متن کامل

On independent domination numbers of grid and toroidal grid directed graphs

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

متن کامل

Performance Evaluation of Tapered, Curved, and Animated Directed-Edge Representations in Node-Link Graphs

We present the results of a study comparing three directed-edge representations in node-link diagrams. Node-link diagrams are probably the most popular type of graph representations; nodes are depicted as dots and links as straight or curved lines connecting the nodes. An arrowhead placed at the end point of a link is traditionally used to indicate edge direction. However, Holten and Van Wijk [...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014